Monochromatic paths for the integers
نویسندگان
چکیده
منابع مشابه
Monochromatic Vs multicolored paths
Let l and k be positive integers, and let X = {0, 1, . . . , l}. Is it true that for every coloring δ : X × X → {0, 1, . . .} there either exist elements x0 < x1 < . . . < xl of X with δ(x0, x1) = δ(x1, x2) = . . . = δ(xl−1, xl), or else there exist elements y0 < y1 < . . . < yk of X with δ(yi−1, yi) 6= δ(yj−1, yj) for all 1 ≤ i < j ≤ k? We prove here that this is the case if either l ≤ 2, or k...
متن کاملMonochromatic Paths and Triangulated Graphs
This paper considers two properties of graphs, one geometrical and one topolog-ical, and shows that they are strongly related. Let G be a graph with four distinguished and distinct vertices, w 1 ; w 2 ; b 1 ; b 2. Consider the two properties, T RI + (G) and M ON O(G), deened as follows. T RI + (G): There is a planar drawing of G such that: all 3-cycles of G are faces; all faces of G are triangl...
متن کاملMonochromatic paths in random tournaments
We prove that, with high probability, any 2-edge-colouring of a random tournament on n vertices contains a monochromatic path of length Ω(n/ √ log n). This resolves a conjecture of Ben-Eliezer, Krivelevich and Sudakov and implies a nearly tight upper bound on the oriented size Ramsey number of a directed path.
متن کاملMonochromatic paths and monochromatic sets of arcs in bipartite tournaments
We call the digraph D an m-coloured digraph if the arcs of D are coloured with m colours and all of them are used. A directed path is called monochromatic if all of its arcs are coloured alike. A set N of vertices of D is called a kernel by monochromatic paths if for every pair of vertices there is no monochromatic path between them and for every vertex v in V (D) \ N there is a monochromatic p...
متن کاملMonochromatic cycles and monochromatic paths in arc-colored digraphs
We call the digraph D an m-colored digraph if the arcs of D are colored with m colors. A path (or a cycle) is called monochromatic if all of its arcs are colored alike. A cycle is called a quasi-monochromatic cycle if with at most one exception all of its arcs are colored alike. A subdigraph H in D is called rainbow if all its arcs have different colors. A set N ⊆ V (D) is said to be a kernel b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2016
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2016.06.002